Link homotopy in ℝ3andS3
نویسندگان
چکیده
منابع مشابه
Vassiliev Homotopy String Link Invariants
We investigate Vassiliev homotopy invariants of string links, and find that in this particular case, most of the questions left unanswered in [3] can be answered affirmatively. In particular, Vassiliev invariants classify string links up to homotopy, and all Vassiliev homotopy string link invariants come from marked surfaces as in [3], using the same construction that in the case of knots gives...
متن کاملAlexander Duality, Gropes and Link Homotopy
We prove a geometric refinement of Alexander duality for certain 2–complexes, the so-called gropes, embedded into 4–space. This refinement can be roughly formulated as saying that 4–dimensional Alexander duality preserves the disjoint Dwyer filtration. In addition, we give new proofs and extended versions of two lemmas of Freedman and Lin which are of central importance in the A-B–slice problem...
متن کامل0 Finite Type Link - Homotopy Invariants
An explicit polynomial in the linking numbers lij and Milnor's triple linking numbers µ(rst) on six component links is shown to be a well-defined finite type link-homotopy invariant. This solves a problem raised by B. Mellor and D. Thurston. An extension of our construction also produces a finite type link invariant which detects the invertibility for some links.
متن کاملFINITE TYPE LINK HOMOTOPY INVARIANTS II: Milnor’s ¯µ-invariants
We define a notion of finite type invariants for links with a fixed linking matrix. We show that Milnor's link homotopy invariant ¯ µ(ijk) is a finite type invariant, of type 1, in this sense. We also generalize this approach to Milnor's higher order ¯ µ invariants and show that they are also, in a sense, of finite type. Finally, we compare our approach to another approach for defining finite t...
متن کاملOn the Link between Gaussian Homotopy Continuation and Convex Envelopes
The continuation method is a popular heuristic in computer vision for nonconvex optimization. The idea is to start from a simplified problem and gradually deform it to the actual task while tracking the solution. It was first used in computer vision under the name of graduated nonconvexity. Since then, it has been utilized explicitly or implicitly in various applications. In fact, state-of-the-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1991
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1991.151.257